Some Greedy Algorithms for Sparse Nonlinear Regression
نویسندگان
چکیده
منابع مشابه
Some Greedy Learning Algorithms for Sparse Regression and Classification with Mercer Kernels
We present some greedy learning algorithms for building sparse nonlinear regression and classification models from observational data using Mercer kernels. Our objective is to develop efficient numerical schemes for reducing the training and runtime complexities of kernel-based algorithms applied to large datasets. In the spirit of Natarajan’s greedy algorithm (Natarajan, 1995), we iteratively ...
متن کاملNonparametric Greedy Algorithms for the Sparse Learning Problem
This paper studies the forward greedy strategy in sparse nonparametric regression. For additive models, we propose an algorithm called additive forward regression; for general multivariate models, we propose an algorithm called generalized forward regression. Both algorithms simultaneously conduct estimation and variable selection in nonparametric settings for the high dimensional sparse learni...
متن کاملRobust Algorithms for Linear and Nonlinear Regression via Spare Modeling Methods: Theory, Algorithms and Applications to Image Denoising
In this dissertation, the problem of robust regression is studied, for both the linear and the nonlinear case. For the former case, a novel algorithm, Greedy Algorithm for Robust Denoising (GARD), which is based on sparse optimization techniques, is derived. Moreover, theoretical conditions, which guarantee the identification of the outliers and a bound on the estimation error, are provided. Ne...
متن کاملSparse Online Greedy Support Vector Regression
We present a novel algorithm for sparse online greedy kernelbased nonlinear regression. This algorithm improves current approaches to kernel-based regression in two aspects. First, it operates online at each time step it observes a single new input sample, performs an update and discards it. Second, the solution maintained is extremely sparse. This is achieved by an explicit greedy sparsificati...
متن کاملGreedy expansions in convex optimization
This paper is a follow up to the previous author’s paper on convex optimization. In that paper we began the process of adjusting greedytype algorithms from nonlinear approximation for finding sparse solutions of convex optimization problems. We modified there three the most popular in nonlinear approximation in Banach spaces greedy algorithms – Weak Chebyshev Greedy Algorithm, Weak Greedy Algor...
متن کامل